Modal Logic and Algebraic Specifications

نویسندگان

  • Lawrence S. Moss
  • Satish R. Thatte
چکیده

The established approaches to the semantics of algebraic (equational) speciications are based on a category-theoretic perspective. When possible interpretations are viewed as a category, the extreme points|the initial and nal algebras|present themselves as natural candidates for the canonical interpretation. However, neither choice provides a satisfactory solution for incomplete speciications of abstract data types|the initial algebra is not abstract enough and the nal algebra often does not exist. We argue that in much of the work on algebraic speciications, the categorical viewpoint is simply a convenient technical device to semantically capture the modalities of necessity and possibility. It is actually more natural to consider the semantic problem from the perspective of modal logic, gathering possible interpretations into a Kripke model. When necessity and possibility are added as modal operators in the logical language, a new candidate for the canonical interpretation|which we call the optimal algebra 1 |arises naturally. The optimal algebra turns out to be a natural generalization of the nal algebra, and provides a satisfactory semantics in situations where the spirit of nal algebra semantics is desired but a nal algebra does not exist. Optimal semantics has a topological avor. Our Kripke models are topological spaces in a natural way. In most (but not all) of the interesting cases, the Baire Category Theorem holds for the topology of a Kripke model, in which case the optimal semantics validates exactly those equational properties which hold in dense open subsets of the Kripke model. In analogy to many similar situations, we may regard these as properties that hold almost everywhere in the model. 1 The term \optimal algebra" was suggested to us by Vaughan Pratt, who also independently arrived at some of the related intuitions. Francesco Parisi-Pressice has informed us that in unpublished work, he considered optimality several years ago, also as a generalization of nal algebra semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic-Coalgebraic Specification in Co Casl

We introduce CoCasl as a light-weight but expressive coalgebraic extension of the algebraic specification language Casl. CoCasl allows the nested combination of algebraic datatypes and coalgebraic process types. Moreover, it provides syntactic sugar for an observer-indexed modal logic that allows e.g. expressing fairness properties. This logic includes a generic definition of modal operators fo...

متن کامل

Specification-Based Testing for CoCasl's Modal Specifications

Specification-based testing is a particular case of black-box testing, which consists in deriving test cases from an analysis of a formal specification. We present in this paper an extension of the most popular and most efficient selection method widely used in the algebraic framework, called axiom unfolding, to coalgebraic specifications, using the modal logic provided by the CoCasl specificat...

متن کامل

Sos 2006

Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this talk, the current state of the art...

متن کامل

Bialgebraic Methods in Structural Operational Semantics: Invited Talk

Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this talk, the current state of the art...

متن کامل

The role of logical interpretations in program development

Stepwise refinement of algebraic specifications is a well known formal methodology for program development. However, traditional notions of refinement based on signature morphisms are often too rigid to capture a number of relevant transformations in the context of software design, reuse, and adaptation. This paper proposes a new approach to refinement in which signature morphisms are replaced ...

متن کامل

Algebraic semantics of refinement modal logic

We develop algebraic semantics of refinement modal logic using duality theory. Refinement modal logic has quantifiers that are interpreted using a refinement relation. A refinement relation is like a bisimulation, except that from the three relational requirements only ‘atoms’ and ‘back’ have to be satisfied. We study the dual notion of refinement on algebras and present algebraic semantics of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 111  شماره 

صفحات  -

تاریخ انتشار 1993